Operational Cycle Assignment in a Configurable IC

ABSTRACT

Some embodiments provide a method of designing a configurable integrated circuit (“IC”) with several configurable circuits. The method receives a design having several sets of operations for the configurable circuits to perform in different operational cycles. For at least a first set of operations that has a start operation and an end operation, the method assigns a particular operation in the first set to a first operational cycle based at least partially on the position of the particular operation with respect to the start and end operations.

FIELD OF THE INVENTION

The present invention is directed towards operational cycle assignmentin a configurable IC.

BACKGROUND OF THE INVENTION

The use of configurable integrated circuits (“IC's”) has dramaticallyincreased in recent years. One example of a configurable IC is a fieldprogrammable gate array (“FPGA”). An FPGA is a field programmable ICthat often has logic circuits, interconnect circuits, and input/output(I/O) circuits. The logic circuits (also called logic blocks) aretypically arranged as an internal array of circuits. These logiccircuits are connected together through numerous interconnect circuits(also called interconnects). The logic and interconnect circuits areoften surrounded by the I/O circuits.

FIG. 1 illustrates an example of a configurable logic circuit 100. Thislogic circuit can be configured to perform a number of differentfunctions. As shown in FIG. 1, the logic circuit 100 receives a set ofinput data 105 and a set of configuration data 110. The configurationdata set is stored in a set of SRAM cells 115. From the set of functionsthat the logic circuit 100 can perform, the configuration data setspecifies a particular function that this circuit has to perform on theinput data set. Once the logic circuit performs its function on theinput data set, it provides the output of this function on a set ofoutput lines 120. The logic circuit 100 is said to be configurable, asthe configuration data set “configures” the logic circuit to perform aparticular function, and this configuration data set can be modified bywriting new data in the SRAM cells. Multiplexers and look-up tables aretwo examples of configurable logic circuits.

FIG. 2 illustrates an example of a configurable interconnect circuit200. This interconnect circuit 200 connects a set of input data 205 to aset of output data 210. This circuit receives configuration data bits215 that are stored in a set of SRAM cells 220. The configuration bitsspecify how the interconnect circuit should connect the input data setto the output data set. The interconnect circuit 200 is said to beconfigurable, as the configuration data set “configures” theinterconnect circuit to use a particular connection scheme that connectsthe input data set to the output data set in a desired manner. Moreover,this configuration data set can be modified by writing new data in theSRAM cells. Multiplexers are one example of interconnect circuits.

FIG. 3 illustrates a portion of a prior art configurable IC 300. Asshown in this figure, the IC 300 includes an array of configurable logiccircuits 305 and configurable interconnect circuits 310. The IC 300 hastwo types of interconnect circuits 310 a and 310 b. Interconnectcircuits 310 a connect interconnect circuits 310 b and logic circuits305, while interconnect circuits 310 b connect interconnect circuits 310a to other interconnect circuits 310 a. In some cases, the IC 300includes hundreds or thousands of logic circuits 305 and interconnectcircuits 310.

Some have recently suggested configurable IC's that are reconfigurableat runtime. The development of reconfigurable IC technology isrelatively in its early stages. One area of this technology that has notyet been fully developed is how to assign different operations that thereconfigurable IC performs to different configuration periods duringruntime. Accordingly, there is a need for a method of designingreconfigurable IC's that uses novel techniques to assign differentoperations performed by the reconfigurable IC to different configurationperiods during runtime.

SUMMARY OF THE INVENTION

Some embodiments provide a method of designing a configurable integratedcircuit (“IC”) with several configurable circuits. The method receives adesign having several sets of operations for the configurable circuitsto perform in different operational cycles. For at least a first set ofoperations that has a start operation and an end operation, the methodassigns a particular operation in the first set to a first operationalcycle based at least partially on the position of the particularoperation with respect to the start and end operations.

In some embodiments, the assignment is based on the distance between theparticular operation and the start and end operations. In someembodiments, the distance is expressed in terms of the duration of theoperations. In some embodiments, the distance is a normalized temporaldistance between the particular operation and the start and endoperations. The normalized temporal distance is derived from theduration of the operations from the start operation to the particularoperation and the duration of the operations from the end operation tothe particular operation. In some embodiments, the configurable IC is asub-cycle reconfigurable IC and the operational cycles are sub-cyclesrelated to a clock cycles. The clock cycle is a clock cycle related tothe design.

In some embodiments, for each several sets of operations that each havea start operation and an end operation, the method further assigns aparticular operation in the set to different operational cycles based atleast partially on the position of the particular operation with respectto the start and end operations in the set of operations.

BRIEF DESCRIPTION OF THE DRAWINGS

The novel features of the invention are set forth in the appendedclaims. However, for purpose of explanation, several embodiments of theinvention are set forth in the following figures.

FIG. 1 illustrates an example of a configurable logic circuit.

FIG. 2 illustrates an example of a configurable interconnect circuit.

FIG. 3 illustrates a portion of a prior art configurable IC.

FIG. 4 illustrates an example of a configurable logic circuit that canperform a set of functions.

FIG. 5 illustrates an example of a configurable interconnect circuit.

FIG. 6 illustrates an example of a configurable node array that includesconfigurable nodes that are arranged in rows and columns.

FIG. 7 illustrates an example of a reconfigurable logic circuit.

FIG. 8 illustrates an example of a reconfigurable interconnect circuit.

FIG. 9 conceptually illustrates an example of a sub-cycle reconfigurableIC.

FIG. 10 illustrates a set of Boolean gates that compute two functionsbased on a set of inputs.

FIG. 11 illustrates the design of FIG. 10 after its gates have beenplaced into four groups.

FIG. 12 illustrates another representation of the design of FIG. 10.

FIG. 13 illustrates a circuit representation of one suchstorage/interconnect circuit.

FIG. 14 illustrates an example of an IC design that includes seventy-twodesign components.

FIG. 15 illustrates a path through a set of components that arecommunicatively coupled to pass data to and receive data from eachother.

FIG. 16 illustrates an example of two paths that are established byeight nets.

FIG. 17 illustrates an example of a reconfigurable IC design that hastwenty reconfigurable circuits.

FIG. 18 pictorially illustrates the relationship between the shortestsignal transit delay in an IC design and the duration of sub-cycles in areconfigurable IC.

FIG. 19 illustrates an example of this concurrent optimization for theexamples illustrated in FIGS. 14 and 17.

FIG. 20 conceptually illustrates an optimization process that theoptimizer of some embodiments performs.

FIG. 21 illustrates an example of computing the normalized metric valuefor the components of the paths of FIG. 16.

FIG. 22 illustrates two examples of assigning the circuits of two pathsto different sub-cycles according to the above-described approach.

FIG. 23 illustrates several state elements that are defined at thesub-cycle boundaries for the examples illustrated in FIG. 22.

FIG. 24 illustrates a move that reassigns a circuit from one sub-cycleto another sub-cycle.

FIG. 25 illustrates how some embodiments define timing constraints thatare based on signal delay in a path that is executed in multiplesub-cycles.

FIG. 26 illustrates operational time extension and the use of stateelements to perform operational time extension.

FIG. 37 illustrates two sets of signal-delay values through the path ofFIG. 26, where one set of values can be rectified.

FIG. 28 illustrates two sets of signal-delay values through the path ofFIG. 26, where one set of values cannot be rectified.

FIG. 29 illustrates another set of numerical values for the durations ofthe operations of the circuits in the example illustrated in FIG. 26.

FIG. 30 illustrates an example of a configurable tile arrangementarchitecture that is formed by numerous configurable tiles that arearranged in an arrangement with multiple rows and columns.

FIG. 31 illustrates an example of a configurable tile arrangementarchitecture that is used in some embodiments of the invention.

FIG. 32 illustrates an example of a configurable tile arrangementarchitecture that is used in some embodiments of the invention.

FIG. 33 illustrates an example of a configurable tile arrangementarchitecture that is used in some embodiments of the invention.

FIG. 34 illustrates an example of a configurable tile arrangementarchitecture that is used in some embodiments of the invention.

FIG. 35 illustrates an example of a configurable tile arrangementarchitecture that is used in some embodiments of the invention.

FIG. 36 illustrates a possible physical architecture of the configurableIC illustrated in FIG. 30.

FIG. 37 presents a computer system with which one embodiment of theinvention is implemented.

DETAILED DESCRIPTION OF THE INVENTION

In the following description, numerous details are set forth for purposeof explanation. However, one of ordinary skill in the art will realizethat the invention may be practiced without the use of these specificdetails. For instance, not all embodiments of the invention need to bepracticed with the specific number of bits and/or specific devices(e.g., multiplexers) referred to below. In other instances, well-knownstructures and devices are shown in block diagram form in order not toobscure the description of the invention with unnecessary detail.

For an IC that has several operational cycles, some embodiments of theinvention provide a method that assigns the components in an IC designto different configurable circuits and different operational cycles ofthe IC. In some embodiments, this method is an optimization process thatconcurrently optimizes the assignment of the IC-design components todifferent configurable circuits and different operational cycles of theIC.

Several more detailed embodiments are described below. In theseembodiments, the IC is a sub-cycle reconfigurable IC. Accordingly, theseembodiments simultaneously optimize the physical design and sub-cycleassignment of a sub-cycle reconfigurable IC. One of ordinary skill willrealize that other embodiments are not used for optimizing sub-cyclereconfigurable IC's. For instance, some embodiments are used to optimizesimultaneously the physical design and reconfiguration cycle of areconfigurable IC that does not reconfigure at a sub-cycle basis (i.e.,reconfigures at a rate slower than a sub-cycle rate). Before describingthese embodiments further, several terms and concepts are defined inSection I.

I. TERMS AND CONCEPTS

A. Configurable IC

A configurable IC is an IC that has configurable circuits. In someembodiments, a configurable IC includes configurable computationalcircuit (e.g., configurable logic circuits) and configurable routingcircuits for routing the signals to and from the configurablecomputation units. In addition to configurable circuits, a configurableIC also typically includes non-configurable circuits (e.g.,non-configurable logic circuits, interconnect circuits, memories, etc.).

A configurable circuit is a circuit that can “configurably” perform aset of operations. Specifically, a configurable circuit receives“configuration data” that specifies the operation that the configurablecircuit has to perform in the set of operations that it can perform. Insome embodiments, configuration data is generated outside of theconfigurable IC. In these embodiments, a set of software tools typicallyconverts a high-level IC design (e.g., a circuit representation or ahardware description language design) into a set of configuration datathat can configure the configurable IC (or more accurately, theconfigurable IC's configurable circuits) to implement the IC design.

Examples of configurable circuits include configurable interconnectcircuits and configurable logic circuits. A logic circuit is a circuitthat can perform a function on a set of input data that it receives. Aconfigurable logic circuit is a logic circuit that can be configured toperform different functions on its input data set.

FIG. 4 illustrates an example of a configurable logic circuit 400 thatcan perform a set of functions. As shown in this figure, the logiccircuit 400 has a set of input terminals 405, a set of output terminals410, and a set of configuration terminals 415. The logic circuit 400receives a set of configuration data along its configuration terminals415. Based on the configuration data, the logic circuit performs aparticular function within its set of functions on the input data thatit receives along its input terminals 405. The logic circuit thenoutputs the result of this function as a set of output data along itsoutput terminal set 410. The logic circuit 400 is said to beconfigurable as the configuration data set “configures” the logiccircuit to perform a particular function.

A configurable interconnect circuit is a circuit that can configurablyconnect an input set to an output set in a variety of manners. FIG. 5illustrates an example of a configurable interconnect circuit 500. Thisinterconnect circuit 500 connects a set of input terminals 505 to a setof output terminals 510, based on a set of configuration data 515 thatthe interconnect circuit receives. In other words, the configurationdata specify how the interconnect circuit should connect the inputterminal set 505 to the output terminal set 510. The interconnectcircuit 500 is said to be configurable as the configuration data set“configures” the interconnect circuit to use a particular connectionscheme that connects the input terminal set to the output terminal setin a desired manner.

An interconnect circuit can connect two terminals or pass a signal fromone terminal to another by establishing an electrical path between theterminals. Alternatively, an interconnect circuit can establish aconnection or pass a signal between two terminals by having the value ofa signal that appears at one terminal appear at the other terminal. Inconnecting two terminals or passing a signal between two terminals, aninterconnect circuit in some embodiments might invert the signal (i.e.,might have the signal appearing at one terminal inverted by the time itappears at the other terminal). In other words, the interconnect circuitof some embodiments implements a logic inversion operation inconjunction to its connection operation. Other embodiments, however, donot build such an inversion operation in some or all of theirinterconnect circuits.

B. Circuit and Configurable Node Arrays

A circuit array is an array with several circuit elements that arearranged in several rows and columns. One example of a circuit array isa configurable node array, which is an array where some or all thecircuit elements are configurable circuits (e.g., configurable logicand/or interconnect circuits). FIG. 6 illustrates an example of aconfigurable node array 600 that includes 208 configurable nodes 605that are arranged in 13 rows and 16 columns. Each configurable node in aconfigurable node array is a configurable circuit that includes one ormore configurable sub-circuits.

In some embodiments, some or all configurable nodes in the array havethe same or similar circuit structure. For instance, in someembodiments, some or all the nodes have the exact same circuit elements(e.g., have the same set of logic gates and circuit blocks and/or sameinterconnect circuits), where one or more of these identical elementsare configurable elements. One such example would be a set of nodespositioned in an array, where each node is formed by a particular set oflogic and interconnects circuits. Having nodes with the same circuitelements simplifies the process for designing and fabricating the IC, asit allows the same circuit designs and mask patterns to be repetitivelyused to design and fabricate the IC.

In some embodiments, the similar configurable nodes not only have thesame circuit elements but also have the same exact internal wiringbetween their circuit elements. For instance, in some embodiments, aparticular set of logic and interconnects circuits that are wired in aparticular manner forms each node in a set of nodes in the array. Havingsuch nodes further simplifies the design and fabrication processes as itfurther simplifies the design and mask making processes.

In some embodiments, each configurable node in a configurable node arrayis a simple or complex configurable logic circuit. In some embodiments,each configurable node in a configurable node array is a configurableinterconnect circuit. In such an array, a configurable node (i.e., aconfigurable interconnect circuit) can connect to one or more logiccircuits. In turn, such logic circuits in some embodiments might bearranged in terms of another configurable logic-circuit array that isinterspersed among the configurable interconnect-circuit array.

Also, some embodiments use a circuit array that includes numerousconfigurable and non-configurable circuits that are placed in multiplerows and columns. In addition, within the above described circuit arraysand/or configurable node arrays, some embodiments disperse othercircuits (e.g., memory blocks, processors, macro blocks, IP blocks,SERDES controllers, clock management units, etc.).

Some embodiments might organize the configurable circuits in anarrangement that does not have all the circuits organized in an arraywith several aligned rows and columns. Accordingly, instead of referringto configurable circuit arrays, the discussion below refers toconfigurable circuit arrangements. Some arrangements may haveconfigurable circuits arranged in one or more arrays, while otherarrangements may not have the configurable circuits arranged in anarray.

C. Reconfigurable IC

Reconfigurable IC's are one type of configurable IC's. ReconfigurableIC's are configurable IC's that can reconfigure during runtime. In otherwords, a reconfigurable IC is an IC that has reconfigurable logiccircuits and/or reconfigurable interconnect circuits, where thereconfigurable logic and/or interconnect circuits are configurable logicand/or interconnect circuits that can “reconfigure” more than once atruntime. A configurable logic or interconnect circuit reconfigures whenit receives a different set of configuration data.

FIG. 7 illustrates an example of a reconfigurable logic circuit 700.This logic circuit includes a core logic circuit 705 that can perform avariety of functions on a set of input data 710 that it receives. Thecore logic circuit 705 also receives a set of four configuration databits 715 through a switching circuit 720, which in this case is formedby four four-to-one multiplexers 740. The switching circuit receives alarger set of sixteen configuration data bits 725 that, in some cases,are stored in a set of storage elements 730 (e.g., a set of memorycells, such as SRAM cells). This switching circuit is controlled by atwo-bit reconfiguration signal φ through two select lines 755. Wheneverthe reconfiguration signal changes, the switching circuit supplies adifferent set of four configuration data bits to the core logic circuit705. The configuration data bits then determine the function that thelogic circuit 705 performs on its input data. The core logic circuit 705then outputs the result of this function on the output terminal set 745.

Any number of known logic circuits (also called logic blocks) can beused in conjunction with the invention. Examples of such known logiccircuits include look-up tables (LUT's), universal logic modules(ULM's), sub-ULM's, multiplexers, and PAL/PLA. In addition, logiccircuits can be complex logic circuit formed by multiple logic andinterconnect circuits. Examples of simple and complex logic circuits canbe found in Architecture and CAD for Deep-Submicron FPGAs, Betz, et al.,ISBN 0792384601, 1999; and in Design of Interconnection Networks forProgrammable Logic, Lemieux, et al., ISBN 1-4020-7700-9, 2003. Otherexamples of reconfigurable logic circuits are provided in U.S. patentapplication Ser. No. 10/882,583, entitled “Configurable Circuits, IC's,and Systems,” filed on Jun. 30, 2004. This application is incorporatedin the present application by reference.

FIG. 8 illustrates an example of a reconfigurable interconnect circuit800. This interconnect circuit includes a core interconnect circuit 805that connects input data terminals 810 to an output data terminal set815 based on a configuration data set 820 that it receives from aswitching circuit 825, which in this example is formed by twofour-to-one multiplexers 840. The switching circuit 825 receives alarger set of configuration data bits 830 that, in some embodiments, arestored in a set of storage elements 835 (e.g., a set of memory cells,such as SRAM cells). This switching circuit is controlled by a two-bitreconfiguration signal φ through two select lines 855. Whenever thereconfiguration signal changes, the switching circuit supplies adifferent set of two configuration data bits to the core interconnectcircuit 805. The configuration data bits then determine the connectionscheme that the interconnect circuit 805 uses to connect the input andoutput terminals 810 and 815.

Any number of known interconnect circuits (also called interconnects orprogrammable interconnects) can be used in conjunction with theinvention. Examples of such interconnect circuits include switch boxes,connection boxes, switching or routing matrices, full- or partial-crossbars, etc. Such interconnects can be implemented using a variety ofknown techniques and structures. Examples of interconnect circuits canbe found in Architecture and CAD for Deep-Submicron FPGAs, Betz, et al.,ISBN 0792384601, 1999, and in Design of Interconnection Networks forProgrammable Logic, Lemieux, et al., ISBN 1-4020-7700-9, 2003. Otherexamples of reconfigurable interconnect circuits are provided in theU.S. patent application Ser. No. 10/882,583.

As mentioned above, the logic and interconnect circuits 700 and 800 eachreceive a reconfiguration signal cp. In some embodiments, this signal isa sub-cycle signal that allows the circuits 700 and 800 to reconfigureon a sub-cycle basis, i.e., to reconfigure one or more times within acycle of a primary clock. The primary clock might be a design clock forwhich the user specifies a design. For instance, when the design is aRegister Transfer Level (RTL) design, the design clock rate can be theclock rate for which the user specifies his or her design in a hardwaredescription language (HDL), such as VHDL or Verilog. Alternatively, theprimary clock might be an interface clock that defines the rate of inputto and/or output from the IC (e.g., the rate that the fastest interfacecircuit of the IC passes signals to and/or receives signals fromcircuits outside of the IC).

Several novel techniques for distributing reconfiguration signals φ aredescribed in U.S. patent application entitled “Configurable IC withInterconnect Circuits that also Perform Storage Operations”, which isfiled concurrently with the present application, with attorney docketnumber TBUL.P0022. In conjunction with these clock distributiontechniques, this application discloses several novel circuits forsupplying configuration data to configurable circuits on a sub-cyclebasis, based on the distributed clock signals.

D. Sub-Cycle Reconfigurable IC

FIG. 9 conceptually illustrates an example of a sub-cycle reconfigurableIC. Specifically, in its top left hand corner, this figure illustratesan IC design 905 that operates at a clock speed of X MHz. Typically, anIC design is initially specified in a hardware description language(HDL), and a synthesis operation is used to convert this HDLrepresentation into a circuit representation. After the synthesisoperation, the IC design includes numerous electronic circuits, whichare referred to below as “components.”

As further illustrated in FIG. 9, the operations performed by thecomponents in the IC design 905 can be partitioned into four sets ofoperations 910-925, with each set of operations being performed at aclock speed of X MHz. FIG. 9 then illustrates that these four sets ofoperations 910-925 can be performed by one sub-cycle reconfigurable IC930 that operates at 4X MHz. In some embodiments, four cycles of the 4XMHz clock correspond to four sub-cycles within a cycle of the X MHzclock. Accordingly, this figure illustrates the reconfigurable IC 930reconfiguring four times during four cycles of the 4X MHz clock (i.e.,during four sub-cycles of the X MHz clock). During each of thesereconfigurations (i.e., during each sub-cycle), the reconfigurable IC930 performs one of the identified four sets of operations. In otherwords, the faster operational speed of the reconfigurable IC 930 allowsthis IC to reconfigure four times during each cycle of the X MHz clock,in order to perform the four sets of operations sequentially at a 4X MHzrate instead of performing the four sets of operations in parallel at anX MHz rate.

Sub-cycle configurability has many advantages. One advantage is that itallows a larger, slower IC design to be implemented by a smaller, fasterIC design. FIGS. 10-15 present an example that illustrates this benefit.FIG. 10 illustrates a set of Boolean gates that compute two functions G3and P3 based on a set of inputs A0, B0, A1, B1, A2, and B2. The set ofBoolean gates has to compute these two functions based on the receivedinput set in one design cycle. In this example, one design cycle lasts10 ns, as the design clock's frequency is 100 MHz. However, in thisexample, each gate can operate at 400 MHz. Hence, each design cycle canbe broken down into 4 sub-cycles of 2.5 ns duration, in order to meetthe design clock frequency of 100 MHz.

FIG. 11 illustrates the design 1000 of FIG. 10 after its gates have beenplaced into four groups. These gates have been placed into four groupsin order to break down the design 1000 into four separate groups ofgates that can be configured and executed in four sub-cycles by asmaller group of gates. The groupings illustrated in FIG. 11 aredesigned to separate out the computation of different sets of gateswhile respecting the operational dependencies of other gates. Forinstance, gates 1005, 1010, and 1015 are defined as a separate groupfrom gates 1020, 1025, and 1030, as these two sets of gates have nooperational dependencies (i.e., the output of the gates in one set isnot dependent on the output of the gates in the other set). As these twosets of gates have no operational dependencies, one set is selected forcomputation during the first sub-cycle (i.e., during phase 1), while theother set is selected for computation during the second sub-cycle (i.e.,during phase 2). On the other hand, gates 1035, 1040, and 1045 aredependent on the outputs of the first two sets of gates. Hence, they aredesignated for configuration and execution during the third sub-cycle(i.e., during phase 3). Finally, the gate 1050 is dependent on theoutput of the first and third sets of gates, and thus it is designatedfor configuration and execution during the fourth sub-cycle (i.e.,during phase 4).

FIG. 12 illustrates another representation of the design 1000 of FIG.10. Like FIG. 11, the schematic in FIG. 12 illustrates four phases ofoperation. However, now, each gate in the design 1000 has been replacedby a sub-cycle configurable logic circuit 1205, 1210, or 1215. Also,only three logic circuits 1205, 1210, and 1215 are used in FIG. 12, aseach of the gates in FIG. 10 can be implemented by one logic circuit,and the groupings illustrated in FIGS. 11 and 12 require at most threegates to be execute during any given phase. (In FIG. 12, each logiccircuit's operation during a particular phase is identified by asuperscript; so, for example, reference numbers 1205 ¹, 1205 ², and 1205³, respectively, identify the operation of the logic circuit 1205 duringphases 1, 2, and 3.)

As shown in FIG. 12, the outputs of certain logic circuits in earlierphases need to be supplied to logic circuit operations in the laterphases. Such earlier outputs can be preserved for later computations byusing state elements (such as registers or latches). Such state elements(not shown) can be standalone circuits or can be part of one or moreinterconnect circuits. For instance, in some embodiments, the stateelements are storage elements that also (1) are interconnect circuits,(2) are part of interconnect circuits, or (3) are placed within or nextto interconnect circuits.

In some of these embodiments, such interconnect circuits are sub-cycleconfigurable interconnect circuits that are configured to connect thelogic circuits in the desired manner. FIG. 13 illustrates a circuitrepresentation of one such storage/interconnect circuit. This circuit1300 is formed by placing a latch 1305 at the output stage of amultiplexer 1310. The latch 1305 receives a latch enable signal. Whenthe latch enable signal is inactive, the circuit simply acts as aninterconnect circuit. On the other hand, when the latch enable signal isactive, the circuit acts as a latch that outputs the value that thecircuit was previously outputting while serving as an interconnectcircuit. Accordingly, when a second circuit in a second later sub-cycleneeds to receive the value of a first circuit in a first earliersub-cycle, the circuit 1300 can be used to receive the value in asub-cycle before the second later sub-cycle (e.g., in the first earliersub-cycle) and to latch and output the value to the second circuit inthe second later sub-cycle. The circuit 1300 and otherstorage/interconnect circuits are further described in U.S. patentapplication entitled “Configurable IC with Interconnect Circuits thatalso Perform Storage Operations”, which is filed concurrently with thepresent application, with attorney docket number TBUL.P0022. Thisapplication is incorporated herein by reference.

FIGS. 10-12 illustrate that sub-cycle configurability allows a ten-gatedesign that operates at 100 MHz to be implemented by three sub-cycleconfigurable logic circuits and associated configurable interconnectcircuits and state elements that operate at 400 MHz. Even fewer thanthree logic circuits might be necessary if one logic gate can performthe operation of two or more gates that are executing during each phaseillustrated in FIG. 11.

II. OVERVIEW

Some embodiments of the invention assign the components in the IC designto different reconfigurable circuits and different sub-cycles of asub-cycle reconfigurable IC. Some of these embodiments utilize anoptimizer that concurrently optimizes the assignment of the IC-designcomponents to different locations (i.e., different physical circuitsites) and different sub-cycles of a sub-cycle reconfigurable IC. Beforedescribing these embodiments, several terms need to be further defined.

A configurable or non-configurable IC design includes numerous circuits(referred to below as design components). For instance, FIG. 14illustrates an example of an IC design 1400 that includes seventy-twodesign components 1405. In an IC design, each component lies on one ormore signal paths (“paths”). For instance, FIG. 15 illustrates a paththrough a set of components that are communicatively coupled to passdata to and receive data from each other. As shown in this figure, apath has two endpoints, a source point 1505 and a target point 1510. Thesource and target designations of the endpoints are based on thedirection of the signal flow through the path.

An IC design also includes numerous nets, where each net specifies a setof component terminals that need to be connected (i.e., each netspecifies the interconnection of a set of component terminals). Forinstance, FIG. 16 illustrates an example of two paths 1600 and 1605 thatare established by eight nets 1610-1645. Seven nets 1610-1640 establishthe path 1600 through user register 1650, components 1652-1662, and userregister 1664. Four nets 1610-1620 and 1645 establish the path 1605through user register 1650, components 1652, 1654, and 1666, and userregister 1668. Except net 1620, all nets are two terminal nets (i.e.,connect two terminals). Net 1620 is a three terminal net (i.e., connectsthree terminals).

A reconfigurable IC design includes numerous reconfigurable circuits,where each reconfigurable circuit is at a physical circuit site in thereconfigurable IC design. For instance, FIG. 17 illustrates an exampleof a reconfigurable IC design 1700 that has twenty reconfigurablecircuits 1705. In each sub-cycle, each reconfigurable circuit can bereconfigured to act as a different configured circuit. Each particularconfigured circuit exists at a particular operational circuit site,which is at a particular physical circuit site in a particularsub-cycle. For example, FIG. 17 illustrates that, in four sub-cycles,the twenty reconfigurable circuits 1705 can serve as eighty configuredcircuits that are at eighty operational circuit sites.

FIG. 18 pictorially illustrates the relationship between the shortestsignal transit delay in an IC design and the duration of sub-cycles in areconfigurable IC. Specifically, this figure illustrates a set of inputregisters 1805, a set of output registers 1810, and a collection 1815 ofdesign components between the register sets 1805 and 1810. Thecollection 1815 of design components perform numerous operations on thedata received by the input register set 1805 to produce the data thatthe design supplies to the output register set 1810. FIG. 18 pictoriallyillustrates the collection 1815 of design components in terms of abubble, to pictorially convey a general collection of components.

FIG. 18 also illustrates an arrow 1820 that represents the shortestsignal transit for data to propagate from the input register set 1805 tothe output register set 1810 through the components 1815. This shortestsignal transit can be used (e.g., by the invention's optimizer) tospecify a duration for each sub-cycle of the reconfigurable IC that willimplement the IC design of FIG. 18. For instance, the duration of eachsub-cycle might be specified as 950 ps when the reconfigurable IC hasfour sub-cycles and the shortest signal transit between the input andoutput register sets is 5000 ps.

Some embodiments of the invention utilize an optimizer that assigns thecomponents in the IC design to different locations (i.e., differentphysical circuit sites) and/or different sub-cycles of a sub-cyclereconfigurable IC. In other words, the invention's optimizer optimizesthe assignment of IC-design components to different operational circuitsites, where some of the operational circuit sites exist in differentsub-cycles. Accordingly, the optimizer concurrently optimizes thephysical-location and sub-cycle assignments of the IC-design components.

Assigning a particular IC-design component to a particular operationalcircuit site that is defined at a particular physical circuit site in aparticular sub-cycle, means that the reconfigurable circuit at theparticular physical circuit site is configured during the particularsub-cycle to perform the operation of the particular IC-design component(i.e., means that the reconfigurable circuit at the particular physicalcircuit site is to be assigned a configuration data set during theparticular sub-cycle that would configure the reconfigurable circuit toperform the operation of the particular IC-design component).

FIG. 19 illustrates an example of this concurrent optimization for theexamples illustrated in FIGS. 14 and 17. FIG. 19 has numerous rows,where each row illustrate a particular assignment of the seventy-twocomponents 1405 in the IC design 1400 of FIG. 14 to seventy-twooperational circuit sites of the reconfigurable IC design 1700 of FIG.17. For instance, the top row 1905 in this figure illustrates an initialassignment of the seventy-two components 1405. As shown in this top row,the initial assignment includes fourteen IC-design components insub-cycle 1, fifteen IC-design components in sub-cycle 2, fourteenIC-design components in sub-cycle 3, and seventeen IC-design componentsin sub-cycle 4.

The first row 1905 and the second row 1910 of FIG. 19 illustrate thereassignment 1970 of one of the IC-design components from oneoperational circuit site within the second sub-cycle to anotheroperational circuit site within the second sub-cycle. Similarly, thesecond and third rows 1910 and 1915 illustrate the reassignment 1975 ofa component from one operational circuit site within the third sub-cycleto another operational circuit site within the third sub-cycle. Themovements illustrated between the first and second rows and between thesecond and third rows are simply movements in the x- and y-locations ofthe assignments of an IC-design component during a particular sub-cycle.

The invention's optimizer, however, also allows for the reassignment ofthe operation of an IC-design component to a different sub-cycle. Inother words, the invention's optimizer allows for the reassignment of anIC-design component to a different operational circuit site (that can beat the same physical circuit site or at a different physical circuitsite) in a different sub-cycle.

FIG. 19 illustrates two examples of such temporal movements.Specifically, the third and fourth rows 1915 and 1920 illustrate thereassigning 1960 of a design component from an operational circuit sitein the first sub-cycle to an operational circuit site in the secondsub-cycle. This reassignment is simply a reassignment in time as bothoperational circuit sites are at the same physical circuit site in thereconfigurable IC.

The fourth and fifth rows 1920 and 1925, on the other hand, illustratean example of a reassignment that is in both time and x-/y-location ofthe operational circuit sites. Specifically, these two rows illustratethe reassigning 1965 of a component from a first operational circuitsite 1930 in the third sub-cycle to a second operational circuit site1935 in the fourth sub-cycle, where the second operational circuit siteis three rows above and three columns to the left of the firstoperational circuit site.

The fourth and fifth rows 1920 and 1925 also illustrate an example of amove that interchanges the time and x-/y-locations of two components inthe IC design. Specifically, this figure illustrates the interchanging1980 of the position of two components at two operational circuit sites1940 and 1945 in two different sub-cycles (i.e., the second and thirdsub-cycles). This interchanging pictorially illustrates the swapping ofthe sub-cycle and physical-location assignment of two IC-designcomponents that are implemented by two reconfigurable circuits in thereconfigurable IC.

III. OVERALL FLOW OF SOME EMBODIMENTS

FIG. 20 conceptually illustrates an optimization process 2000 that theoptimizer of some embodiments performs. The optimization process 2000assigns the circuits in an IC design to different locations (i.e.,different physical circuit sites) and/or different sub-cycles of asub-cycle reconfigurable IC that will implement the IC design. In otherwords, this process simultaneously optimizes the physical-location andsub-cycle assignments of the IC-design components within thereconfigurable IC.

In some embodiments, this optimization process is performed by a placerthat identifies the physical-location and sub-cycle assignment of theIC-design components. In other embodiments, a combined placer/routertool performs the optimization process 2000 (1) to specify the designcomponent's physical-location and sub-cycle assignments, andsimultaneously (2) to specify the interconnections between thesecircuits (e.g., to specify the interconnect circuits between theassigned design components).

As shown in FIG. 20, the process 2000 initially identifies (at 2005) astarting operational circuit site (i.e., an initial physical locationand sub-cycle) for each design component that it has to place. Thisidentification entails assigning an initial sub-cycle for each circuitin each path in the IC design. The initial sub-cycle assignment in someembodiments involves (1) performing a topologic sort of the componentsbased on their positions in their respective paths, and (2) dividing thesorted components between the different sub-cycles based on this sort.

An IC-design component might be on multiple paths. Accordingly, in someembodiments, the topological sort entails computing for each component atopological metric value that accounts for all the paths that containthe particular component. Some embodiments compute the topologicalmetric value for a particular component by (1) identifying the maximumdistance D_(MAXSRC) between the particular component to the source pointof any path that contains the particular component, (2) identifying themaximum distance D_(MAXTGT) between the particular component to thetarget point of any path that contains the particular component, and (3)expressing the topological metric value as a normalized distance metricequal to

$\frac{D_{MAXSRC}}{D_{MAXSRC} + D_{MAXTGT}}.$

Different embodiments express distance values (e.g., the distancebetween a component and a source or target point of a path) differently.For instance, some embodiments express the distance between a particularcomponent and a point in the path (1) in terms of the number ofintervening components between the particular component and the point,(2) in terms of the overall signal delay through the interveningcomponents, or (3) in terms of a combination of the number, signaldelay, or other attributes of the intervening components.

FIG. 21 illustrates an example of computing the normalized metric valuefor the components of the paths 1600 and 1605 of FIG. 16. In thisexample, it is assumed that the components on the paths 1600 and 1605are not on any other paths. Also, in this example, the distance betweena particular component and a source or target point is expressed interms of the number of components (including the particular component)between the output or input of the particular point and the source ortarget point. For instance, component 1654 has two components (includingitself) between its output and register 1650, whose output is the sourcepoint for both paths 1600 and 1605. The component 1654 has fivecomponents (including itself) between its input and register 1664, whoseinput is the target point for path 1600.

For each component, FIG. 21 illustrates (1) the maximum source/targetdistance between the particular component and a source/target of a pathon which the component resides and (2) the normalized distance metricthat is computed based on these maximum distance values. For example,the distance between the component 1654 and the target of path 1600 isfive, while its distance to the target of path 1605 is two. The maximumdistance between the component 1654 and the source point of path 1600 or1605 is two. Hence, FIG. 21 illustrates that the maximum distancebetween the component 1654 and the targets of the paths on which thecomponent 1654 resides is five, and the maximum distance between thiscomponent and the sources of the paths on which it resides is two. Basedon these two values, the normalized distance metric for the component1654 is 2/7, as illustrated in FIG. 21.

After computing the normalized distance metric for each circuit in thepath, the optimizer sorts (at 2005) the circuits in the path accordingto an ascending order of normalized distance metric values. The processthen assigns (at 2005) circuits to different sub-cycles based on thisorder. For instance, in some embodiments that employ a four sub-cyclereconfigurable IC, the process might assign (1) the first quarter of thecircuits with the lowest normalized distance metric values to the firstsub-cycle, (2) the second quarter of the circuits with the next lowestnormalized distance metric values to the second sub-cycle, (3) the thirdquarter of the circuits with the next lowest normalized distance metricvalues to the fourth sub-cycle, and (4) the last quarter of the circuitswith the next lowest normalized distance metric values to the fourthsub-cycle.

FIG. 22 illustrates two examples of assigning the circuits of two paths2200 and 2220 to different sub-cycles according to the above-describedapproach. In these examples, the first quarter of the IC-designcomponents have a normalized distance metric that is not greater than0.35, the second quarter of the IC-design components have a normalizeddistance metric that is not greater than 0.6, the third quarter of theIC-design components have a normalized distance metric that is notgreater than 0.85, and the fourth quarter of the IC-design componentshave a normalized distance metric that is not less than 0.85.

Near each sub-cycle transition between an earlier sub-cycle and a latersub-cycle, the process specifies (at 2005) state elements to maintainthe path's state at the end of the earlier sub-cycle for the firstcircuit in the later sub-cycle. As mentioned above, some embodiments useinterconnect/storage circuits as such state elements. FIG. 23illustrates several state elements 2305 that are defined at thesub-cycle boundaries for the examples illustrated in FIG. 22. In someembodiments, a state element can also be defined behind one or morecircuits that are closer to a sub-cycle boundary.

Also, in some cases, the state elements specified at 2005 are stateelements that are inserted after the identification (at 2005) of theinitial sub-cycle assignment. In other cases, these elements arecircuit-path interconnects that operate as interconnects in onesub-cycle, and operate as a storage element in the subsequent sub-cycle.Such could be the case, for instance, in the embodiments that use theprocess 2000 as part of a placer/router that specifies the physicallocation and sub-cycle assignment of both logic and interconnectcircuits.

After identifying the initial sub-cycle assignment and specifying thestate elements at the sub-cycle boundaries, the process 2000 defines (at2005) an initial location for the circuits (including the stateelements) in each path. The initial location for each circuit is arandom location. The initial location for each circuit might result inseveral paths that exceed sub-cycle time allocations in one or moresub-cycles.

After specifying (at 2005) the initial placement, the process 2000selects (at 2010) a circuit (i.e., a design component or state element)that can be assigned a new physical location and/or a new sub-cycle.After selecting (at 2010) a circuit that can be reassigned in space orin time, the process identifies (at 2015) a potential “move” for theselected circuit. In some embodiments, identifying a potential moveentails identifying a new operational circuit site (i.e., a new physicallocation and/or a new sub-cycle) for the selected circuit. In somecases, the identified new operational circuit site might be associatedwith another circuit, when it is identified as a new potential circuitsite for the selected circuit. Hence, in these cases, the move entailsswapping the temporal and/or physical location of the selected circuitwith the temporal and/or physical location of another circuit, which hasto be a “moveable” circuit in the embodiments that have temporalrestrictions on moving circuits.

In some embodiments, the process does not select (at 2015) a potentialmove that causes the violation of one or more particular timing rules.One example of such a timing rule is a prohibition of some embodimentsagainst allowing a first circuit that is earlier than a second circuitin a path to be placed in a sub-cycle that is later than the currentlyassigned sub-cycle of the second circuit. Specifically, in someembodiments, the optimization process 2000 cannot always reassign aparticular circuit from a first operational circuit site in a firstearlier sub-cycle to a second operational circuit site in a second latersub-cycle, when the particular circuit is part of a path that hasanother circuit that (1) is after the particular circuit in the path,but (2) is before the second sub-cycle.

Instead of, or in conjunction with this timing rule, some embodimentsconsider at 2015 other timing rules. One example of such a timing ruleis a prohibition against two circuits occupying the same operationalcircuit site. Another example of such a timing rule is a prohibitionagainst exceeding sub-cycle timing constraints with respect to logicaldepth or delay. Section IV provides several examples of timingconstraints relating to overall signal path delay and sub-cycle signalpath delay.

Other embodiments, however, do not place such restrictions onreassigning circuits to different sub-cycles. For instance, someembodiments allow a first circuit in a path that is before a secondcircuit in the path to be placed in a sub-cycle that is after the secondcircuit's sub-cycle, as these embodiments account for the toroidalnature of sub-cycle reconfiguration. These embodiments might allow apath's earlier circuit to be placed in a second sub-cycle that is aftera first sub-cycle that contains the path's later circuit. Theseembodiments would allow such an assignment as the second sub-cycle in afirst primary cycle would be before the first sub-cycle in a secondprimary cycle that is after the first primary cycle.

However, in some of the embodiments, the optimization process 2000 canmake moves that violate one or more timing rules, but penalizes suchmoves when costing them (at 2020). Penalizing moves are furtherdescribed below. Some embodiments do not allow moves that violatecertain timing rule or rules, while allowing but penalizing moves thatviolate other timing rule or rules.

Once the process identifies a new physical and/or temporal location forthe selected circuit, the process determines (at 2020) whether to assignthe newly identified operational circuit site to the selected circuit.In some embodiments, this determination includes computing a cost forthe potential new assignment (or assignments in case of a swap) and thenmaking a determination based on this cost whether to accept the newassignment (or assignments).

Three issues need to be considered in performing this computation anddetermination. The first issue is whether the computed cost expresses adelta cost associated with a potential move, or whether the computedcost expresses the overall cost of the design (e.g., the overall cost ofthe placement in some embodiments, or the placement and routing in otherembodiments). In other words, the computed cost expresses differentcosts in different embodiments of the invention.

In some embodiments, the computed cost is a delta cost associated withthe potential move. In some of these embodiments, this delta cost can bea positive or negative cost, where, in some embodiments, a negative costimplies an improvement in the design (e.g., in a temporal or physicalplacement and/or routing in the design), while a positive cost impliesdeterioration in the design.

In other embodiments, the computed cost is the overall cost of thedesign when the selected circuit is placed at the newly identifiedoperational circuit site, which, as mentioned above, might entail themovement of another circuit to the selected circuit's currentoperational site. In yet other embodiments, the computed cost expressesa combination of a delta cost and an overall cost.

The second issue is whether the computed cost expressly accounts for aphysical-location reassignment, a sub-cycle reassignment, or both. Aphysical-location reassignment is a reassignment to a new operationalcircuit site that is at a different physical circuit site than thecurrent operational circuit site of the circuit. Some embodimentscompute a cost for a new potential physical location for the selectedcircuit based on traditional metrics that account for the change in theexpected wire length and/or congestion that might result if the selectedcircuit is moved to the identified operational circuit site (i.e., thesite identified at 2015). When this move entails swapping the physicallocation of the selected circuit with the physical location of anothercircuit, the cost of the physical-location reassignment accounts for themovement of the other circuit as well (e.g., accounts for the change inthe expected wire length and/or congestion due to the movement of theother circuit).

A sub-cycle reassignment is a reassignment of the selected circuit to anew sub-cycle (i.e., from one operational circuit site that is in onesub-cycle to another operational circuit site that is in anothersub-cycle). Some embodiments compute a cost for a new sub-cycleassignment based on a metric that accounts for change in the congestion(e.g., for the increase or decrease in the congestion of all the pathsor of one or more paths that include the selected circuit) in thecurrent and potentially future sub-cycle of the selected circuit. Whenthe move entails swapping the sub-cycle assignment of the selectedcircuit with the sub-cycle assignment of another circuit, the cost ofthe sub-cycle reassignment accounts for the movement of the othercircuit as well (e.g., accounts for the change in the expected sub-cyclecongestion due to the movement of the other circuit).

Some embodiments do not expressly account for potential sub-cyclereassignments, and instead only expressly account for potentialreassignments in physical location. For instance, when costing a move ofthe selected circuit between two operational circuit sites that occupythe same physical circuit site in two different sub-cycles, someembodiments do not expressly assign a cost for the change, so long asthe move does not create a timing violation.

However, even some of these embodiments implicitly account for potentialsub-cycle reassignments. For instance, some embodiments do not allow theselected circuit to be moved to a new sub-cycle when such a move wouldcause a timing violation in one or more sub-cycles. One example of atiming violation would occur when the assignment of the selected circuitto the new sub-cycle would cause the selected circuit's path to exceedthe available time period for operation in the new sub-cycle. Forinstance, assume that the identified move reassigns the fourth circuit2205 in the first path 2200 in FIG. 22 from the second sub-cycle to thethird sub-cycle, as illustrated in parts (a) and (b) of FIG. 24. Such amove might result in a timing violation as the operation of the fourth,fifth, and sixth circuits 2205-2215 of the path 2200 might exceed theallotted time period for the third sub-cycle (e.g., the signal transitthrough the fourth, fifth, and sixth circuits might take longer than theX number of picoseconds that represents the time period for the thirdsub-cycle).

On the other hand, whenever feasible, some embodiments allow a move to anew sub-cycle even when such a move causes a path (e.g., a pathcontaining the selected circuit or containing a circuit that swappedwith the selected circuit) to exceed the duration of one or moresub-cycles. In some embodiments, the process 2000 allow such moves ifthe timing violations can be rectified through “retiming,” or can beameliorated through “operational time extension.”

In certain situations, retiming can rectify a timing violation thatoccurs when a move causes a path to exceed its duration in one or moresub-cycle. For instance, in some embodiments, retiming assigns one ormore circuits from a congested sub-cycle to another sub-cycle to reducethe path's duration in the congested sub-cycle. Part (c) of FIG. 24illustrates an example of such a retiming. Specifically, this partillustrates the reassignment of the circuit 2215 from the third to thefourth sub-cycle. This retiming reduces the duration of the path 2200 inthe third sub-cycle below its assigned sub-cycle duration, and therebyalleviates the over congestion in this path during the third sub-cyclethat resulted form the move of the circuit 2205 to the third sub-cycle.As shown in part (c) FIG. 24, the retiming requires the state element2405 to be placed before the circuit 2215 instead of being placed afterthis circuit.

It might not always be possible to rectify a timing violation throughretiming. In certain situations, the process 2000 can address a timingviolation in a sub-cycle through operational time extension, i.e., byallowing the operations of one or more of the circuits to spill over tothe previous or subsequent sub-cycles. Such time-extension moves mightnot always be possible, but whenever such moves are possible, they arepenalized in some embodiments in order to bias the optimizer not to maketoo many of such moves. Accordingly, instead of prohibiting sub-cyclereassignments that result in the operations of the circuits in a path toexceed the duration(s) of one or more sub-cycles, some embodiments allowthe optimization process 2000 to consider such reassignments wheneverpossible but require the process to assess a penalty cost for makingsuch a reassignment. Operational time extension will be furtherdescribed below in Section V.

It should be noted that timing violations might occur even when theidentified move is within the same sub-cycle (i.e., even when theidentified move is between two operational circuit sites in the samesub-cycle). For instance, a physical location reassignment of theselected circuit might result in the operations of the circuits in apath to exceed the duration(s) of one or more sub-cycles. Again, someembodiments prohibit such timing violations, while other embodimentsallow such timing violations so long as they can be rectified throughretiming or operational time extension, which is penalized as mentionedabove.

The third issue to consider in performing the computation anddetermination operations at 2020 is how the determination is made oncethe cost is computed. How this determination is made is dependent on thetype of optimization technique used to perform the operations of theprocess 2000. For instance, some optimization techniques (e.g., localoptimization) only accept moves that improve the computed cost (e.g.,only accept moves that have negative delta cost or reduce the overallcost). Other optimization techniques (e.g., simulated annealing) acceptmoves that increase the computed cost, but accept fewer such worse movesover time.

When the process 2000 determines (at 2020) that the operation circuitsite identified at 2015 should be accepted, the process transitions to2025, where it moves the selected circuit to the newly identifiedoperational circuit site. When the move identified at 2015 entailsswapping the physical location and/or sub-cycle assignment of theselected circuit with the physical location and/or sub-cycle assignmentof another circuit, the process 2000 swaps the physical location and/orsub-cycle assignments of the two circuits. From 2025, the processtransitions to 2030. The process also transitions to 2030, when itdetermines that the newly identified operational circuit site should notbe accepted for the selected circuit.

At 2030, the process determines whether it should stop its iterations.Again, how this determination is made is dependent on the type ofoptimization technique used to perform the operations of the process2000. For instance, some embodiments stop the iterations after failingto improve the computed cost by an acceptable threshold after certainnumber of failed iterations. In some embodiments, the acceptablethreshold and number of failed iterations changes over time (i.e.,changes with the number of iterations).

If the process determines (at 2030) that it should not stop, it returnsto 2010 to select another circuit for moving, and then repeats thesubsequent operations 2015-2030 for the newly selected circuit. When theprocess determines (at 2030) that it should stop the iterations, itends.

The invention's optimization process was described above by reference tothe optimization process 2000, which sets out one particular way ofperforming the optimization. One of ordinary skill will realize that theoptimization process is performed differently in other embodiments ofthe invention. For instance, instead of selecting one circuit to moveeach time at 2010, some embodiments select one or more circuits to moveat each iteration through 2010. Also, the process 2000 first computes ascore based on an identified move and then moves the selected circuitbased on the computed score. Other embodiments, however, might firstmove the selected circuit, then compute a score to assess the move, andthen move the selected circuit back to its original operational circuitsite after an assessment that the move should not have been made.

IV. TIMING CONSTRAINTS

FIG. 25 illustrates how some embodiments define timing constraints thatare based on signal delay in a path that is executed in multiplesub-cycles. In some embodiments, the optimizer examines these timingconstraints for a path each time that it tries to move one or more ofthe circuits on the path.

FIG. 25 illustrates a path 2500 between two registers 2505 and 2510.This path is implemented in four sub-cycles that are enabled by thethree state elements 2515, 2520, and 2525, which maintain the signal atthe sub-cycle boundaries. In this example, the three state elements areeach an interconnect/storage element 1300 of FIG. 13. This element canoperate as an interconnect or as a latch. As such, each element 2515,2520, or 2525 will be referred to below as a latch.

Each latch 2515, 2520, or 2525 operates in two sub-cycles (e.g., whenthe latch is an interconnect/storage element, the latch operates as aninterconnect element in one sub-cycle and a storage element in anothersub-cycle, as mentioned above). However, FIG. 25 illustrates thesub-cycle boundary after the latch because, in this example, thesub-cycles are defined to start at the input of a circuit after a latch.Other embodiments, however, might define the sub-cycle boundarydifferently.

Ten timing constraints are illustrated in FIG. 25. These ten timingconstraints include four single sub-cycle constraints 2530, 2532, 2534,and 2536. They also include six constraints for six contiguouslyneighboring sets of sub-cycles. These six constraints are (1) threedouble sub-cycle constraints 2538, 2540, and 2542, (2) two triplesub-cycle constraints 2544 and 2546, and (3) a quadruple sub-cycleconstraint 2548.

Each single sub-cycle constraint requires the sub-cycle's duration to beless than the duration allotted to the sub-cycle. As mentioned above,each sub-cycle starts from the first circuit in the sub-cycle, excludingany latch that facilitates the path signal flow during the sub-cycle.Each sub-cycle except the last ends at the start of the latch thatfacilitates the next sub-cycle, while the last sub-cycle ends at theinput of the circuit that is the path's destination.

Similarly, each double, triple, or quadruple sub-cycle constraintrequires the duration of the two, three, or four sub-cycles to be lessthan the duration allotted to the two, three, or four sub-cycles. Thestart of each two, three, or four sub-cycles is the first circuit in thetwo, three, or four sub-cycles, excluding any latch that facilitates thepath signal flow during the first sub-cycle in the set of sub-cycles.Each sub-cycle set that does not include the last sub-cycle ends at thestart of the latch that facilitates the next sub-cycle, while anysub-cycle set that terminates the last sub-cycle ends at the input ofthe circuit that is the path's destination.

Accordingly, these rules define the following durations for thesub-cycles or the contiguously neighboring sub-cycle sets in FIG. 25:

-   -   Duration of sub-cycle 1 is measured (for the timing constraint        2530) from the start of the register 2505 to the input of the        latch 2515.    -   Duration of sub-cycle 2 is measured (for the timing constraint        2532) from the start of the circuit 2550 to the input of the        latch 2520.    -   Duration of sub-cycle 3 is measured (for the timing constraint        2534) from the start of the circuit 2552 to the input of the        latch 2525.    -   Duration of sub-cycle 4 is measured (for the timing constraint        2536) from the start of the register 2554 to the input of the        register 2510.    -   Duration of neighboring sub-cycles 1 and 2 is measured (for the        timing constraint 2538) from the start of the register 2505 to        the input of the latch 2520.    -   Duration of neighboring sub-cycles 2 and 3 is measured (for the        timing constraint 2540) from the start of the circuit 2550 to        the input of the 2525.    -   Duration of neighboring sub-cycles 3 and 4 is measured (for the        timing constraint 2542) from the start of the circuit 2552 to        the input of the register 2510.    -   Duration of neighboring sub-cycles 1, 2, and 3 is measured (for        the timing constraint 2544) from the start of the register 2505        to the input of the latch 2525.    -   Duration of neighboring sub-cycles 2, 3, and 4 is measured (for        the timing constraint 2546) from the start of the circuit 2550        to the input of the register 2510.    -   Duration of neighboring sub-cycles 1, 2, 3, and 4 is measured        (for the timing constraint 2548) from the start of the register        2505 to the input of the register 2510.

The path 2500 is legal from a timing point of view when it does notviolate any of the ten timing constraints. If the path 2500 cannot meetthe timing constraint that is defined over the entire path (i.e.,overall-path timing constraint, which in this case is the quadruplesub-cycle constraint 2548), then it cannot be made legal throughretiming or operational time extension. When the path meets theoverall-path timing constraint 2548 (i.e., when the duration of theneighboring sub-cycles 1, 2, 3, and 4 is less than the sum of the foursub-cycle durations), it might not meet one of the other sub-cycle orsub-cycle set constraints. However, in this situation, it might bepossible to make the path legal through retiming, and it will bepossible to make the path legal through time extension, as furtherdescribed below.

The examples above and below discuss optimizing a four sub-cycle design.Other embodiments, however, might include some other number ofreconfiguration sub-cycles, like six or eight. Using the guidelinesprovided above, these embodiments have a different number of signaldelay timing constraints. Assuming that a path has at least one circuitin each sub-cycle that needs to be reconfigured in that sub-cycle, thepath in a six sub-cycle embodiment would have to satisfy: 1 sixsub-cycle constraint, 2 five sub-cycle constraints, 3 four sub-cycleconstraints, 4 three sub-cycle constraints, 5 two sub-cycle constraints,and 6 single sub-cycle constraints. Assuming that a path has at leastone circuit in each sub-cycle that needs to be reconfigured in thatsub-cycle, the path in an eight sub-cycle embodiment would have tosatisfy: 1 eight sub-cycle constraints, 2 seven sub-cycle constraints, 3six sub-cycle constraints, 4 five sub-cycle constraints, 5 foursub-cycle constraints, 6 three sub-cycle constraints, 7 two sub-cycleconstraints, and 8 single sub-cycle constraints. In addition, otherembodiments might define the signal delay timing constraintsdifferently, or define the sub-cycle or the sub-cycle set durationsdifferently.

V. OPERATIONAL TIME EXTENSION

As mentioned above, some embodiments allow the operation of a circuitthat is assigned to one sub-cycle to start or end in another sub-cycle.In other words, these embodiments allow the circuit to time extend inone or more sub-cycles that are before and/or after the circuit'sassigned sub-cycle. The optimizer of some embodiments penalizes eachmove that will cause the duration of the operation of the circuitsassigned to one sub-cycle to exceed the sub-cycle's duration. Theoptimizer penalizes such moves as these moves reduce the overallreconfigurable nature of the reconfigurable IC. They reduce the IC'sreconfigurability by having one circuit operate in more than onesub-cycle, which reduces the number of operational circuit sites for theother circuits in the design.

In some embodiments, operational time extension is enabled through theuse of state elements that can maintain their states (e.g., can store avalue). Such state elements maintain the input of the time-borrowingcircuit in the sub-cycle or sub-cycles that the circuit borrows. In theexamples described below, this state element is the interconnect/storageelement 1300 of FIG. 13. This element can operate as an interconnect oras a latch. As such, this element will be referred to below as a latch.

FIG. 26 provides an example that illustrates operational time extensionand the use of latches to perform operational time extension.Specifically, this figure illustrates a path 2600 between two userregisters 2665 and 2670. The path 2600 includes twelve circuits. Asshown in part (a) of FIG. 26, the operation of these circuits isinitially divided into four sub-cycles, with three circuits in eachsub-cycle. As shown in part (a) of FIG. 26, three of the twelve circuitsare latches 2615, 2630, and 2645 that are defined at the sub-cycleboundaries. The latches 2615, 2630, and 2645 are defined from the startto extend their operation from one sub-cycle to the next (i.e., toreceive data in one sub-cycle and latch and hold the received data inthe next sub-cycle).

Parts (a) and (b) of FIG. 26 illustrate reassignment of the circuit 2625from the second sub-cycle to the third sub-cycle. As shown in part (b)of FIG. 26, this reassignment moves the latch 2630 from the front of thecircuit 2625 to back of the circuit 2625. This reassignment also leadsto the time period for the third sub-cycle terminating before theoperation of the circuit 2640 has been completed.

Accordingly, to solve this short fall, the circuit 2640 is assigned toboth the third and fourth sub-cycles, as shown in part (c) of FIG. 26.The latch 2640 is moved from in front of the circuit 2645 to behind thecircuit 2645, as this new position is needed to facilitate thetransition between the third and fourth sub-cycles. In this position,the interconnect/storage circuit 2645 acts during the third sub-cycle asan interconnect circuit that passes the signal from the circuit 2635 tothe circuit 2640, while acting during the fourth sub-cycle as a latchthat outputs the value that the interconnect circuit 2645 was outputtingduring the third sub-cycle. In other words, the interconnect circuit2645 acts as a storage element in the fourth sub-cycle in order toprovide the circuit 2640 with the same input during the third and fourthsub-cycle, so that the circuit 2640 can complete its operation duringthe fourth sub-cycle along with the circuits 2650, 2655, and 2660.

In the example illustrated in FIG. 26, the circuit 2645 is aninterconnect/storage circuit that is moved after the optimizeridentifies the move for the circuit 2625. When this interconnect/storagecircuit is moved from the front to the back of the circuit 2640, itmight be moved from one physical circuit site to another physicalcircuit site, or it might be at the same physical circuit site butdefined to receive the output of the circuit 2635 instead of the outputof the circuit 2640.

More generally, after identifying a move, the optimization process 2000might determine that the move results in the operation of a pathviolating one or more signal delay timing constraints over one or moresections of the path. The optimization process 2000 then will try toaddress the timing constraint violation through retiming or timeextensions. Both retiming and time extension involve shorting a sectionof the path that does not meet one or more timing constraint, by movingthe latch at the end of the section back in the path. Moving the latchback in the path reduces the length of the section of the path (behindthe latch) that does not meet one or more timing constraints. This move,however, expands the duration of the path in front of the latch that ismoved back.

Both retiming and time extension require a latch to be moved in thepath. In some embodiments, retiming can be performed by moving the latchbackwards or forwards in a path, while time extension only allows thelatch to be moved back in the path. Another difference between retimingand time extension is that in retiming, the latch commences its storageoperation (e.g., its latching operation) at a boundary between twosub-cycles, while in time extension, the latch commences its storageoperation (e.g., its latching operation) behind one or more circuitsthat commence their operations in the earlier of the two sub-cycles.

A retiming move still needs to result in a path that meets all singleand multi sub-cycle constraints. A time-extension move also needs toresult in a path that meets all applicable single and multi sub-cycleconstraints, except that the time extending circuits are not taken intoconsideration when considering one or more of the constraints.Specifically, when considering a time-extension move of a particularlatch that is between a first earlier sub-cycle and a second latersub-cycle, all timing constraints that relate to durations that end withthe particular latch have to be met. Also, the time-extension move hasto meet all timing constraints that are measured starting at the firstcircuit after the last time extending circuit (i.e., starting at thefirst circuit of the second sub-cycle). In addition, the time-extensionmove has to meet all timing constraints that are measured starting atthe first circuit of the first sub-cycle and ending with the latch orregister at the end of the second sub-cycle.

In some embodiments, time extensions might result in the elimination ofone or more timing constraints, except the overall-path timingconstraint. Specifically, when considering a time-extension move of afirst latch that is between a first earlier sub-cycle and a second latersub-cycle, one possible move would be to move the latch behind all ofthe circuits that are to operate in an first earlier sub-cycle. When theoptimization process 2000 is left with only such a move, the processconsiders eliminating the latch between the earlier and later sub-cyclesand having all the circuits in the earlier sub-cycle time extend into(i.e., also operate in) the later sub-cycle. This time extensionpossibility would rely on a second latch that is between the firstearlier sub-cycle and a third sub-cycle that is before the first earliersub-cycle. This time extension possibility effectively eliminates thetiming constraints that were defined with respect to the eliminatedlatch. Also, if this time extension does not lead to a path that meetsthe timing constraints, the process 2000 can explore moving the secondlatch back in the third sub-cycle.

Alternatively, when a time extension operation results in a first latchbeing moved backward to abut a second prior latch in a particular path,some embodiments do not eliminate the first latch or the timingconstraints that were defined by reference to the first latch. Theseembodiments maintain such a first latch to simplify the timing analysisof the particular path during any move of this path's circuits, whichmight later be identified by the optimizer. Also, the timing constraintsthat are defined by reference to the first latch remain after the movethat abuts the first and second latch, although these timing constraintswould mostly be perfunctory as there is no duration or little durationdefined between the two latches, in some embodiments.

Timing extension and retiming will now be further described by providingdifferent signal delay values for the path 2600 of FIG. 26. In theprevious discussion of this example, it was assumed that time extendingthe operation of the circuit 2640 to the fourth sub-cycle allows thesignal to pass through the path 2600 within the allotted time. However,in certain situations, this might not be the case. To illustrate this,FIGS. 37 and 28 present two sets of signal-delay values through the path2600 of FIG. 26. One set of values (the ones provided in FIG. 37) can berectified through time extending the operation of the circuit 2640,while the other set of values (the ones provided in FIG. 28) cannot. Inboth these examples, it is assumed that the signal has to pass throughthe path 2600 in 4000 picoseconds (ps), and that each sub-cycle is 1000ps long.

In the example illustrated in FIG. 37, the actual duration of operationof the circuits in each sub-cycle before the move is 700 ps, as shown inpart (a) of this figure. Given this operational duration, FIG. 37illustrates an example where the timing violation caused by thereassignment of the circuit 2625 (to the third sub-cycle) can bealleviated through operational time extension. Specifically, part (b) ofFIG. 37 illustrates that the duration of the third sub-cycle is 1050 psafter the assignment of the circuit 2625 to this sub-cycle. However,part (c) of FIG. 37 illustrates that allowing the circuit 2640 to timeextend into the fourth sub-cycle, leads to a signal flow that meets allthree constraints that are at issue at the boundary of the third andfourth sub-cycles. Specifically, time extending the operation of thecircuit 2640 results in:

-   -   1. a combined signal path delay of 1750 ps from the input of        circuit 2625 to the input of the user register 2670 (i.e., a        duration of 1750 ps for the circuits operating in the third and        fourth sub-cycles), which does not exceed the 2000 ps allotted        for the third and fourth sub-cycles;    -   2. a signal path delay that does not exceed 1000 ps from the        input of the circuit 2625 to the input of the latch 2645 (i.e.,        a duration that does not exceed 1000 ps for the operations of        the circuits in the third sub-cycle before the latch 2645);    -   3. a signal path delay that does not exceed 1000 ps from the        input of the circuit 2650 (which is the first circuit after the        last time extending circuit 2640) to the input of the user        register 2670.

In the example illustrated in FIG. 28, the actual duration of operationof the circuits in each sub-cycle before the move is 900 ps, as shown inpart (a) of this figure. Given this operational duration, FIG. 28illustrates an example where the timing violation caused by thereassignment of the circuit 2625 (to the third sub-cycle) is notalleviated through one operational time extension. Specifically, part(b) of FIG. 28 illustrates that the duration of the third sub-cycle is950 ps after the assignment of the circuit 2625 to this sub-cycle.Moreover, part (c) of FIG. 28 illustrates that even with the circuit2640 time extending into the fourth sub-cycle, the combined duration ofthe third and fourth sub-cycles is 2150 ps, which is more than theavailable 2000 ps for these two sub-cycles. However, this situationmight be alleviated through other time extension (e.g., potentiallymoving latch 2630 behind 2620, which would result in time extendingacross more than one sub-cycle).

Time extensions are useful in addressing time violations that cannot befixed through retiming. To illustrate this, FIG. 29 presents another setof numerical values for the durations of the operations of the circuitsin the example illustrated in FIG. 26. Part (a) of FIG. 29 illustratesthat the duration of the operation of the circuits in the first, secondand fourth sub-cycles are 900 ps each, while the duration of theoperation of the circuits in the third sub-cycle is 1100 ps, whichexceeds the 1000 ps allotment. In other words, part (a) shows that thepath initially has a timing violation in sub-cycle 3.

Part (b) of this figure illustrates that this timing violation cannot becured through retiming. Specifically, it illustrates that moving theoperation of the circuit 2640 to the fourth sub-cycle creates a timingviolation in the fourth sub-cycle (i.e., it causes the duration of theoperation of the circuits in the fourth sub-cycle to be 900 ps, whichexceeds the 1000 ps allotment).

However, the timing violation illustrated in part (a) of FIG. 29 can beaddressed through time extending the operation of the circuit 2640 intothe fourth sub-cycle, as shown in part (c) of this figure. This timeextension is achieved by moving the circuit 2645 behind the circuit2640. This move creates a path that meets the constraints mentionedabove. Specifically, it results in:

-   -   1. a combined signal path delay of 2000 ps from the input of the        circuit 2635 to the input of the user register 2670 (i.e., a        duration of 2000 ps for the circuits operating in the third and        fourth sub-cycles), which does not exceed the 2000 ps allotted        for the third and fourth sub-cycles;    -   2. a signal path delay of 400 ps from the input of the circuit        2635 to the input of the latch 2645 (i.e., a duration of 400 ps        for the operations of the circuits in the third sub-cycle before        the latch 2645);    -   3. a signal path delay of 900 ps from the input of the circuit        2650 (which is the first circuit after the last time extending        circuit 2640) to the input of the user register 2670.

In the description above, the latch (e.g., latch 2645) that facilitatesthe time extension can be viewed as one of the time extending circuits.Whether the latch is one of the time extending circuits is an issue ofnomenclature in the cases where the latch is moved from a sub-cycleboundary to a position behind the maintained circuits that are timeextended. This is because in this situation the latch (e.g., latch 2645)would have operated in the third and fourth sub-cycles even had it notbeen moved from the boundary of these two sub-cycles.

Although time extension was described above by reference to numerousdetails, one of ordinary skill will realize that other embodiments mightperform time extensions differently. For instance, as mentioned above,some embodiments perform the optimization process 2000 as part of arouting operation that defines interconnect circuits (i.e., a routingcircuit) for connecting the various circuits of a path that was placedpreviously to the routing operation or is being concurrently placed withthe routing operation. In such embodiments, the process can facilitatetime extensions by moving a latch from a sub-cycle boundary to the backof the maintained circuit(s).

Alternatively, if one of the circuits behind the maintained circuit(s)is an interconnect circuit, the process can also use this interconnectcircuit as the latch that facilitates the time extension when thiscircuit is an interconnect/storage circuit. When this interconnectcircuit is not an interconnect/storage circuit, the process can alsoreplace this interconnect circuit with an interconnect/storage circuitthat serves as a latch that facilitates the time extension. In theseembodiments, whether the optimization process supports the timeextension by moving a latch from a sub-cycle boundary or utilizing aninterconnect/storage circuit before maintained circuit(s) depends on oneor more factors, such as (1) the proximity of the interconnect/storagecircuit from the maintained circuit(s), (2) the delay due to an extralatch that might be avoided by reusing an available interconnect/storagecircuit, etc.

VI. RECONFIGURABLE ARCHITECTURES

FIGS. 30-35 illustrate an example of a configurable tile arrangementarchitecture that is used in some embodiments of the invention. As shownin FIG. 30, this architecture is formed by numerous configurable tiles3005 that are arranged in an array with multiple rows and columns. InFIGS. 30-35, each configurable tile includes a sub-cycle reconfigurablethree-input look up table (LUT) 3010, three sub-cycle reconfigurableinput-select multiplexers 3015, 3020, and 3025, and two sub-cyclereconfigurable routing multiplexers 3030 and 3035. Other configurabletiles can include other types of circuits, such as memory arrays insteadof logic circuits.

In FIGS. 30-35, an input-select multiplexer is an interconnect circuitassociated with the LUT 3010 that is in the same tile as the inputselect multiplexer. One such input select multiplexer receives severalinput signals for its associated LUT and passes one of these inputsignals to its associated LUT.

In FIGS. 30-35, a routing multiplexer is an interconnect circuit that ata macro level connects other logic and/or interconnect circuits. Inother words, unlike an input select multiplexer in these figures thatonly provides its output to a single logic circuit (i.e., that only hasa fan out of one), a routing multiplexer in some embodiments eitherprovides its output to several logic and/or interconnect circuits (i.e.,has a fan out greater than one), or provides its output to otherinterconnect circuits.

FIGS. 31-35 illustrate the connection scheme used to connect themultiplexers of one tile with the LUT's and multiplexers of other tiles.This connection scheme is further described in U.S. patent applicationentitled “Configurable IC with Routing Circuits with OffsetConnections”, filed concurrently with this application with attorneydocket number TBUL.P0036. This application is incorporated herein byreference.

In the architecture illustrated in FIGS. 30-35, each tile includes onethree-input LUT, three input-select multiplexers, and two routingmultiplexers. Other embodiments, however, might have a different numberof LUT's in each tile, a different number of inputs for each LUT, adifferent number of input-select multiplexers, and/or a different numberof routing multiplexers. For instance, some embodiments might employ anarchitecture that has in each tile: one three-input LUT, threeinput-select multiplexers, and eight routing multiplexers. Several sucharchitectures are further described in the above-incorporated patentapplication.

In some embodiments, the examples illustrated in FIGS. 30-35 representthe actual physical architecture of a configurable IC. However, in otherembodiments, the examples illustrated in FIGS. 30-35 topologicallyillustrate the architecture of a configurable IC (i.e., they showconnections between circuits in the configurable IC, without specifying(1) a particular geometric layout for the wire segments that establishthe connection, or even (2) a particular position of the circuits). Insome embodiments, the position and orientation of the circuits in theactual physical architecture of a configurable IC is different than theposition and orientation of the circuits in the topological architectureof the configurable IC. Accordingly, in these embodiments, the IC'sphysical architecture appears quite different than its topologicalarchitecture. For example, FIG. 36 provides one possible physicalarchitecture of the configurable IC 3000 illustrated in FIG. 30. Thisand other architectures are further described in the above-incorporatedpatent application.

VII. COMPUTER SYSTEM

FIG. 37 presents a computer system with which one embodiment of theinvention is implemented. Computer system 3700 includes a bus 3705, aprocessor 3710, a system memory 3715, a read-only memory 3720, apermanent storage device 3725, input devices 3730, and output devices3735. The bus 3705 collectively represents all system, peripheral, andchipset buses that communicatively connect the numerous internal devicesof the computer system 3700. For instance, the bus 3705 communicativelyconnects the processor 3710 with the read-only memory 3720, the systemmemory 3715, and the permanent storage device 3725.

From these various memory units, the processor 3710 retrievesinstructions to execute and data to process in order to execute theprocesses of the invention. The read-only-memory (ROM) 3720 storesstatic data and instructions that are needed by the processor 3710 andother modules of the computer system.

The permanent storage device 3725, on the other hand, is aread-and-write memory device. This device is a non-volatile memory unitthat stores instructions and data even when the computer system 3700 isoff. Some embodiments of the invention use a mass-storage device (suchas a magnetic or optical disk and its corresponding disk drive) as thepermanent storage device 3725.

Other embodiments use a removable storage device (such as a floppy diskor Zip® disk, and its corresponding disk drive) as the permanent storagedevice. Like the permanent storage device 3725, the system memory 3715is a read-and-write memory device. However, unlike storage device 3725,the system memory is a volatile read-and-write memory, such as a randomaccess memory. The system memory stores some of the instructions anddata that the processor needs at runtime. In some embodiments, theinvention's processes are stored in the system memory 3715, thepermanent storage device 3725, and/or the read-only memory 3720.

The bus 3705 also connects to the input and output devices 3730 and3735. The input devices enable the user to communicate information andselect commands to the computer system. The input devices 3730 includealphanumeric keyboards and cursor-controllers. The output devices 3735display images generated by the computer system. The output devicesinclude printers and display devices, such as cathode ray tubes (CRT) orliquid crystal displays (LCD).

Finally, as shown in FIG. 37, bus 3705 also couples computer 3700 to anetwork 3745 through a network adapter (not shown). In this manner, thecomputer can be a part of a network of computers (such as a local areanetwork (“LAN”), a wide area network (“WAN”), or an Intranet) or anetwork of networks (such as the Internet). Any or all of the componentsof computer system 3700 may be used in conjunction with the invention.However, one of ordinary skill in the art would appreciate that anyother system configuration may also be used in conjunction with thepresent invention.

While the invention has been described with reference to numerousspecific details, one of ordinary skill in the art will recognize thatthe invention can be embodied in other specific forms without departingfrom the spirit of the invention. For instance, several embodiments weredescribed above that simultaneously optimize the physical design andsub-cycle assignment of a sub-cycle reconfigurable IC. One of ordinaryskill will realize that other embodiments are not to be used foroptimizing sub-cycle reconfigurable IC's. For instance, some embodimentsare used to optimize simultaneously the physical design andreconfiguration cycle of a reconfigurable IC that does not reconfigureat a sub-cycle basis (i.e., reconfigures at a rate slower than asub-cycle rate). Thus, one of ordinary skill in the art would understandthat the invention is not to be limited by the foregoing illustrativedetails, but rather is to be defined by the appended claims.

1-20. (canceled)
 21. A method of designing an integrated circuit (“IC”)with a plurality of configurable circuits, the method comprising: a)receiving a design comprising a plurality of signal paths, each signalpath defined by a set of components communicatively coupled to eachother; and b) for each of a plurality of components, assigning acomponent in a signal path to an operational cycle based at leastpartially on a distance value for the component in the signal path,wherein the distance value is computed at least partially based onsignal delay through the path.
 22. The method of claim 28, wherein eachsignal path has a source point and a target point, wherein the assigningis based at least partially on the distance value for the component withrespect to the source point and target point of the signal pathincluding the component.
 23. A computer readable medium storing acomputer program which when executed by at least one processor designsan integrated circuit (“IC”) with a plurality of configurable circuits,the computer program comprising sets of instructions for: a) receiving adesign comprising a plurality of signal paths, each signal path definedby a set of components communicatively coupled to each other; and b) foreach of a plurality of components, assigning a component in a signalpath to an operational cycle based at least partially on a distancevalue for the component in the signal path, wherein the distance valueaccounts for signal delay through the path.
 24. The computer readablemedium of claim 30, wherein each signal path has a source point and atarget point, wherein the assigning is based at least partially on thedistance value for the component with respect to the source point andtarget point of the signal path including the component.